Balanced fair resource sharing in computer clusters

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balanced fair resource sharing in computer clusters

We represent a computer cluster as a multi-server queue with some arbitrary bipartite graph of compatibilities between jobs and servers. Each server processes its jobs sequentially in FCFS order. The service rate of a job at any given time is the sum of the service rates of all servers processing this job. We show that the corresponding queue is quasi-reversible and use this property to design ...

متن کامل

Performance analysis in multi-hop radio networks with balanced fair resource sharing

Balanced fairness is a new resource sharing concept recently introduced by Bonald and Proutière. We extend the use of this notion to wireless multi-hop networks, e.g. ad hoc networks, where the link capacities at the flow level are not fixed but depend on lower layer issues such as scheduling and interference. Utilizing this extension we present the theoretical framework for flow level performa...

متن کامل

Weighted Fair Sharing for Dynamic Virtual Clusters

In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support wide (parallel) requests for variable-sized pool of resources, provide assurance of minimum resource allotment on demand, and give predictable assignments to plan their resource usage (e.g., advance reservations). Our a...

متن کامل

Fair intergenerational sharing of a natural resource

In this article, overlapping generations are extracting a natural resource over an infinite future. We examine the fair allocation of resource and compensations among generations. Fairness is defined by core lower bounds and aspiration upper bounds. The core lower bounds require that every coalition of generations obtains at least what it could achieve by itself. The aspiration upper bounds req...

متن کامل

Resource - Sharing Computer Communications Networks

communications,” presented at the Ass. Comput. Mach. Symp. Operating Systems, Gatlinburg, Tenn., 1967. [45] -, “A forward look,” Signal, vol. 25, pp. 77-81, Aug. 1971. 1461 -, ‘Resource sharing networks,’ presented at the IEEE Int. Conv., New York, N. Y., Mar. 1969. [47] L. G. Roberts and B. Wessler, “The ARP.4 computer network development to achieve resource sharing, in Spring Joint Compztfer

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Performance Evaluation

سال: 2017

ISSN: 0166-5316

DOI: 10.1016/j.peva.2017.08.006